Computational Complementarity and Shift Spaces

Computational complementarity was introduced to mimic the physical complementarity in terms of nite automata (with outputs but no initial state). Most of the work has been focussed on \frames", i.e., on xed, static, local descriptions of the system behaviour. The rst paper aiming to study the asymptotical description of complementarity was restricted to certain types of so c shifts. In this paper we continue this work and extend the results to all irreducible so c shifts. We also study computational complementarity in terms of labelled graphs rather than automata.